Termination w.r.t. Q proof of TRS/currying/AG01#3.2.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.

↳ QTRS

  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(quot, 0), app(s, x0))
app(app(quot, app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(minus, x), app(s, y)) → APP(pred, app(app(minus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter2, app(f, x)), f)
APP(app(app(app(filter2, false), f), x), xs) → APP(filter, f)
APP(app(minus, x), app(s, y)) → APP(app(minus, x), y)
APP(app(quot, app(s, x)), app(s, y)) → APP(app(minus, x), y)
APP(app(quot, app(s, x)), app(s, y)) → APP(minus, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(filter2, app(f, x)), f), x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(cons, x), app(app(filter, f), xs))
APP(app(app(app(filter2, true), f), x), xs) → APP(filter, f)
APP(app(filter, f), app(app(cons, x), xs)) → APP(filter2, app(f, x))
APP(app(quot, app(s, x)), app(s, y)) → APP(quot, app(app(minus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(app(app(filter2, true), f), x), xs) → APP(cons, x)
APP(app(quot, app(s, x)), app(s, y)) → APP(app(quot, app(app(minus, x), y)), app(s, y))
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
APP(app(quot, app(s, x)), app(s, y)) → APP(s, app(app(quot, app(app(minus, x), y)), app(s, y)))

The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(quot, 0), app(s, x0))
app(app(quot, app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(minus, x), app(s, y)) → APP(pred, app(app(minus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter2, app(f, x)), f)
APP(app(app(app(filter2, false), f), x), xs) → APP(filter, f)
APP(app(minus, x), app(s, y)) → APP(app(minus, x), y)
APP(app(quot, app(s, x)), app(s, y)) → APP(app(minus, x), y)
APP(app(quot, app(s, x)), app(s, y)) → APP(minus, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(filter2, app(f, x)), f), x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(cons, x), app(app(filter, f), xs))
APP(app(app(app(filter2, true), f), x), xs) → APP(filter, f)
APP(app(filter, f), app(app(cons, x), xs)) → APP(filter2, app(f, x))
APP(app(quot, app(s, x)), app(s, y)) → APP(quot, app(app(minus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(app(app(filter2, true), f), x), xs) → APP(cons, x)
APP(app(quot, app(s, x)), app(s, y)) → APP(app(quot, app(app(minus, x), y)), app(s, y))
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
APP(app(quot, app(s, x)), app(s, y)) → APP(s, app(app(quot, app(app(minus, x), y)), app(s, y)))

The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(quot, 0), app(s, x0))
app(app(quot, app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
We deleted some edges using various graph approximations

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(minus, x), app(s, y)) → APP(pred, app(app(minus, x), y))
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter2, app(f, x)), f)
APP(app(app(app(filter2, false), f), x), xs) → APP(filter, f)
APP(app(minus, x), app(s, y)) → APP(app(minus, x), y)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(filter2, app(f, x)), f), x)
APP(app(quot, app(s, x)), app(s, y)) → APP(minus, x)
APP(app(quot, app(s, x)), app(s, y)) → APP(app(minus, x), y)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(cons, x), app(app(filter, f), xs))
APP(app(app(app(filter2, true), f), x), xs) → APP(filter, f)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(quot, app(s, x)), app(s, y)) → APP(quot, app(app(minus, x), y))
APP(app(filter, f), app(app(cons, x), xs)) → APP(filter2, app(f, x))
APP(app(app(app(filter2, true), f), x), xs) → APP(cons, x)
APP(app(quot, app(s, x)), app(s, y)) → APP(app(quot, app(app(minus, x), y)), app(s, y))
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
APP(app(quot, app(s, x)), app(s, y)) → APP(s, app(app(quot, app(app(minus, x), y)), app(s, y)))

The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(quot, 0), app(s, x0))
app(app(quot, app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 3 SCCs with 14 less nodes.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(minus, x), app(s, y)) → APP(app(minus, x), y)

The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(quot, 0), app(s, x0))
app(app(quot, app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13]. Here, we combined the reduction pair processor with the A-transformation [14] which results in the following intermediate Q-DP Problem.
Q DP problem:
The TRS P consists of the following rules:

MINUS(x, s(y)) → MINUS(x, y)

R is empty.
The set Q consists of the following terms:

PRED(s(x0))
minus(x0, 0)
minus(x0, s(x1))
quot(0, s(x0))
quot(s(x0), s(x1))
map(x0, nil)
map(x0, cons(x1, x2))
filter(x0, nil)
filter(x0, cons(x1, x2))
filter2(true, x0, x1, x2)
filter2(false, x0, x1, x2)

We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(app(minus, x), app(s, y)) → APP(app(minus, x), y)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
MINUS(x1, x2) = MINUS(x1, x2)
s(x1) = s(x1)

Recursive path order with status [2].
Quasi-Precedence:

[MINUS₂, s_1]

Status:

s₁: [1]
MINUS₂: multiset

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

                  ↳ QDP

                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(quot, 0), app(s, x0))
app(app(quot, app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP(app(quot, app(s, x)), app(s, y)) → APP(app(quot, app(app(minus, x), y)), app(s, y))

The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(quot, 0), app(s, x0))
app(app(quot, app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

QUOT(s(x), s(y)) → QUOT(minus(x, y), s(y))

The TRS R consists of the following rules:

minus(x, 0) → x
minus(x, s(y)) → pred(minus(x, y))
pred(s(x)) → x

The set Q consists of the following terms:

pred(s(x0))
minus(x0, 0)
minus(x0, s(x1))
quot(0, s(x0))
quot(s(x0), s(x1))
map(x0, nil)
map(x0, cons(x1, x2))
filter(x0, nil)
filter(x0, cons(x1, x2))
filter2(true, x0, x1, x2)
filter2(false, x0, x1, x2)

We have to consider all minimal (P,Q,R)-chains.

The following pairs can be oriented strictly and are deleted.

APP(app(quot, app(s, x)), app(s, y)) → APP(app(quot, app(app(minus, x), y)), app(s, y))

The remaining pairs can at least be oriented weakly.
none
Used ordering: Combined order from the following AFS and order.
QUOT(x1, x2) = QUOT(x1, x2)
s(x1) = s(x1)
minus(x1, x2) = x1
pred(x1) = x1
0 = 0

Recursive path order with status [2].
Quasi-Precedence:

QUOT₂ > s₁

Status:

QUOT₂: [2,1]
s₁: [1]
0: multiset

The following usable rules [14] were oriented:

app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(minus, x), 0) → x
app(pred, app(s, x)) → x

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

                  ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(quot, 0), app(s, x0))
app(app(quot, app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)

The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(quot, 0), app(s, x0))
app(app(quot, app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)

The remaining pairs can at least be oriented weakly.

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)

Used ordering: Combined order from the following AFS and order.
APP(x1, x2) = APP(x2)
app(x1, x2) = app(x1, x2)
filter2 = filter2
true = true
filter = filter
map = map
cons = cons
false = false
quot = quot
s = s
minus = minus
pred = pred
nil = nil
0 = 0

Recursive path order with status [2].
Quasi-Precedence:

[APP₁, cons] > [filter2, filter] > app₂ > [map, quot]
true > app₂ > [map, quot]
false > app₂ > [map, quot]
s > app₂ > [map, quot]
s > 0 > [map, quot]
[minus, pred] > app₂ > [map, quot]
nil > [map, quot]

Status:

APP₁: [1]
pred: multiset
map: multiset
0: multiset
s: multiset
minus: multiset
nil: multiset
cons: multiset
filter: multiset
true: multiset
false: multiset
app₂: [2,1]
filter2: multiset
quot: multiset

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ EdgeDeletionProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)

The TRS R consists of the following rules:

app(pred, app(s, x)) → x
app(app(minus, x), 0) → x
app(app(minus, x), app(s, y)) → app(pred, app(app(minus, x), y))
app(app(quot, 0), app(s, y)) → 0
app(app(quot, app(s, x)), app(s, y)) → app(s, app(app(quot, app(app(minus, x), y)), app(s, y)))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

The set Q consists of the following terms:

app(pred, app(s, x0))
app(app(minus, x0), 0)
app(app(minus, x0), app(s, x1))
app(app(quot, 0), app(s, x0))
app(app(quot, app(s, x0)), app(s, x1))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 2 less nodes.